Inequalities from Two Rows of a Simplex Tableau
نویسندگان
چکیده
In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice point free bodies and the derivation of inequalities for mixed integer linear programs by considering two rows of a simplex tableau simultaneously.
منابع مشابه
Mixed-integer sets from two rows of two adjacent simplex bases
In [1] we studied a mixed-integer set arising from two rows of a simplex tableau. We showed that facets of such a set can be obtained from lattice point free triangles and quadrilaterals associated with either three or four variables. In this paper we generalize our findings and show that, when upper bounds on the non-basic variables are also considered, further classes of facets arise that can...
متن کاملOn degenerate multi-row Gomory cuts
Borozan and Cornuéjols introduced a semi-infinite relaxation for mixed-integer linear programs, derived from the simplex tableau relative to a fractional vertex f of the linear relaxation. They showed that any minimal valid inequality for such relaxation is determined by a maximal lattice-free convex set containing f . In this note we show that, for the purpose of generating cuts for the origin...
متن کاملComputational Experiments with Cross and Crooked Cross Cuts
In a recent paper, Dash, Dey and Günlük (2010) showed that many families of inequalities for the two-row continuous group relaxation and variants of this relaxation are cross cuts or crooked cross cuts, both of which generalize split cuts. Li and Richard (2008) recently studied t-branch split cuts for mixedinteger programs for integers t ≥ 1. Split cuts are just 1-branch split cuts, and cross c...
متن کاملLifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
Recently, Andersen et al. [1] and Borozan and Cornuéjols [3] characterized the minimal inequalities of a system of two rows with two free integer variables and nonnegative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal lattice-free convex sets. In order to use these minimal inequalities to obtain cuts from two rows of a general simplex ...
متن کاملSplit Rank of Triangle and Quadrilateral Inequalities
A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. Recently Andersen et al. [3] and Cornuéjols and Margot [17] showed that the facet-defining inequalities of this set are either split cuts or intersection cuts obtained from lattice-free triangles and quadrilaterals. Throug...
متن کامل